Adapting Biochemical Kripke Structures for Distributed Model Checking

On Model Checking Durational Kripke Structures

We consider quantitative model checking in durational Kripke structures (Kripke structures where transitions have integer durations) with timed temporal logics where subscripts put quantitative constraints on the time it takes before a property is satisfied. We investigate the conditions that allow polynomial-time model checking algorithms for timed versions of CTL and exhibit an important gap ...

On model checking durational Kripke structures (Extended Abstract)

Computing (bi)simulation relations preserving CTLX for ordinary and fair Kripke structures

The main goal of model checking is to verify whether a model of a given program satisfies some given specification. In this paper models are regarded as fair or ordinary Kripke structures whereas specifications are represented by formulae branching-time temporal logics (CTL∗X or ACTL ∗ X ). Model checking can be substantially enhanced by reducing the size of models under consideration. Usually ...

Model checking finite paths and trees

This thesis presents efficient parallel algorithms for checking temporal logic formulas over finite paths and trees. We show that LTL path checking is in AC(logDCFL) and CTL tree checking is in AC(logDCFL). For LTL with pasttime and bounded modalities, which is an exponentially more succinct logic, we show that the path checking problem remains in AC(logDCFL). Our results provide a foundation f...

Disjunctive Logic Programming and Possible Model Semantics

We use Kripke structures of autoepistemic logic to classify various semantics for disjunctive logic programs with default negation. We have observed that nonmonotonic reasoning can be characterized by Kripke structures whose beliefs are justiied. We also observed that two diierent types of negative introspection in autoepistemic reasoning present two diierent interpretations of default negation...